منابع مشابه
Fast and Flexible Incremental CRC Calculation
1 1 ) ( − − = l l a A C 1 1 ) mod ) ( ( ) ( − − + = i i i a p A xC A C ) ( ) ( 0 A C A C = Efficient implementations use bit-level parallelism by working on words of an appropriate size w, combining w iterative steps into one. Hardware implementations typically use an XOR matrix [3] to implement the resulting function , while software prefers look-up tables [1]. In both cases the per-polynomial...
متن کاملA Fast CRC Update Implementation
In networking environments, the cyclic redundancy check (CRC) is widely utilized to determine whether errors have been introduced during transmissions over physical links. In this paper, we focus on the CRC calculation that is performed during the routing of the Ethernet packets by encapsulating the packets into Ethernet frames, adding a frame header and adding a frame trailer. The CRC code is ...
متن کاملChoosing a CRC polynomial and associated method for Fast CRC Computation on Intel® Processors white paper
Cyclic Redundancy Check (CRC) codes are widely used for integrity checking of data in fields such as storage and networking. Fast and efficient methods of computing CRC on Intel® processors have been proposed for the fixed (degree-32) iSCSI polynomial, using the CRC32 instruction introduced in the Intel® Core™ i7 Processors. In addition, the PCLMULQDQ instruction can be used for fast CRC comput...
متن کاملHigh Performance Table-Based Algorithm for Pipelined CRC Calculation
In this paper, we present a fast cyclic redundancy check (CRC) algorithm that performs CRC computation for an arbitrary length of message in parallel. For a given message with any length, the algorithm first chunks the message into blocks, each of which has a fixed size equal to the degree of the generator polynomial. Then it computes CRC for the chunked blocks in parallel using lookup tables, ...
متن کاملFast parallel CRC algorithm and implementation on a configurable processor
-In this paper we present a fast cyclic redundancy check (CRC) algorithm that performs CRC computation for any length of message in parallel. For a given message with any length, we first chunk the message into blocks, each of which has a fixed size equal to the degree of the generator polynomial. Then we perform CRC computation among the chunked blocks in parallel using Galois Field multiplica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2004
ISSN: 0013-5194
DOI: 10.1049/el:20040032